Unitary rank structured matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unitary rank structured matrices

In this paper we describe how one can represent a unitary rank structured matrix in an efficient way as a product of unitary or Givens transformations. We provide also some basic operations for manipulating the representation, such as the transition to zerocreating form, the transition to a unitary/Givens-weight representation, as well as an internal pull-through process of the two branches of ...

متن کامل

Eigenvalue computation for unitary rank structured matrices

In this paper we describe how to compute the eigenvalues of a unitary rank structured matrix in two steps. First we perform a reduction of the given matrix into Hessenberg form, next we compute the eigenvalues of this resulting Hessenberg matrix via an implicit QR-algorithm. Along the way, we explainhow the knowledge of a certain ‘shift’ correction term to the structure can be used to speed up ...

متن کامل

Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding

This paper is concerned with the reduction of a unitary matrix U to CMV-like shape. A Lanczos–type algorithm is presented which carries out the reduction by computing the block tridiagonal form of the Hermitian part of U , i.e., of the matrix U +UH . By elaborating on the Lanczos approach we also propose an alternative algorithm using elementary matrices which is numerically stable. If U is ran...

متن کامل

Rank structured matrices: theory, algorithms and applications

In numerical linear algebra much attention has been paid to matrices that are sparse, i.e., containing a lot of zeros. For example, to compute the eigenvalues of a general dense symmetric matrix, this matrix is first reduced to a similar tridiagonal one using an orthogonal similarity transformation. The subsequent QR-algorithm performed on this n×n tridiagonal matrix, takes the sparse structure...

متن کامل

Compressing Rank-Structured Matrices via Randomized Sampling

Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient but have off-diagonal blocks that are—specifically, the classes of so-called hierarchically off-diagonal low rank (HODL...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2008

ISSN: 0377-0427

DOI: 10.1016/j.cam.2007.03.020